Structural complexity theory

Results: 144



#Item
31On Rank Aggregation of Multiple Orderings in Network Design  Hadas Shachnai, Computer Science Dept., Technion, Haifa 32000, Israel Lisa Zhang, Bell Labs, Lucent Technologies, 600 Mountain Ave., Murray Hill, NJ 07974

On Rank Aggregation of Multiple Orderings in Network Design  Hadas Shachnai, Computer Science Dept., Technion, Haifa 32000, Israel Lisa Zhang, Bell Labs, Lucent Technologies, 600 Mountain Ave., Murray Hill, NJ 07974

Add to Reading List

Source URL: www.cs.technion.ac.il

Language: English - Date: 2007-03-07 16:59:32
32Structural Filtering A Paradigm for EÆcient and Exact Geometric Programs Stefan Funke Kurt Mehlhorny

Structural Filtering A Paradigm for EÆcient and Exact Geometric Programs Stefan Funke Kurt Mehlhorny

Add to Reading List

Source URL: www.cccg.ca

Language: English - Date: 2003-06-20 16:00:19
33Algorithms Lecture 30: NP-Hard Problems [Fa’14] [I]n his short and broken treatise he provides an eternal example—not of laws, or even of method, for there is no method except to be very intelligent, but

Algorithms Lecture 30: NP-Hard Problems [Fa’14] [I]n his short and broken treatise he provides an eternal example—not of laws, or even of method, for there is no method except to be very intelligent, but

Add to Reading List

Source URL: web.engr.illinois.edu

Language: English - Date: 2014-12-28 09:03:23
34

PDF Document

Add to Reading List

Source URL: navet.ics.hawaii.edu

Language: English - Date: 2012-03-11 17:05:29
35Decentralized Generic Rigidity Evaluation in Interconnected Systems Ryan K. Williams, Andrea Gasparri, Attilio Priolo, and Gaurav S. Sukhatme Abstract— In this paper, we consider the problem of evaluating the generic (

Decentralized Generic Rigidity Evaluation in Interconnected Systems Ryan K. Williams, Andrea Gasparri, Attilio Priolo, and Gaurav S. Sukhatme Abstract— In this paper, we consider the problem of evaluating the generic (

Add to Reading List

Source URL: robotics.usc.edu

Language: English - Date: 2014-04-15 18:21:08
36Improving Exhaustive Search Implies Superpolynomial Lower Bounds Ryan Williams∗ IBM Almaden Research Center May 4, 2010

Improving Exhaustive Search Implies Superpolynomial Lower Bounds Ryan Williams∗ IBM Almaden Research Center May 4, 2010

Add to Reading List

Source URL: www.stanford.edu

Language: English - Date: 2010-05-04 16:48:34
37Policy Sciences), © Elsevier Scientific Publishing Company, Amsterdam--Printed in Scotland Dilemmas in a General Theory of Planning* H O R S T W. J. R I T T E L

Policy Sciences), © Elsevier Scientific Publishing Company, Amsterdam--Printed in Scotland Dilemmas in a General Theory of Planning* H O R S T W. J. R I T T E L

Add to Reading List

Source URL: jonathanstray.com

Language: English - Date: 2012-03-19 14:37:31
38Chicago Journal of Theoretical Computer Science The MIT Press Volume 1999, Article 7 The Permanent Requires Large Uniform Threshold Circuits

Chicago Journal of Theoretical Computer Science The MIT Press Volume 1999, Article 7 The Permanent Requires Large Uniform Threshold Circuits

Add to Reading List

Source URL: cjtcs.cs.uchicago.edu

Language: English - Date: 1999-10-13 17:17:47
39A Parameterized Complexity Analysis of Combinatorial Feature Selection Problems? Vincent Froese, Ren´e van Bevern, Rolf Niedermeier, and Manuel Sorge Institut f¨ ur Softwaretechnik und Theoretische Informatik, TU Berli

A Parameterized Complexity Analysis of Combinatorial Feature Selection Problems? Vincent Froese, Ren´e van Bevern, Rolf Niedermeier, and Manuel Sorge Institut f¨ ur Softwaretechnik und Theoretische Informatik, TU Berli

Add to Reading List

Source URL: fpt.akt.tu-berlin.de

Language: English - Date: 2013-06-19 10:42:56
40Some Minesweeper Configurations Richard Kaye School of Mathematics The University of Birmingham Birmingham B15 2TT

Some Minesweeper Configurations Richard Kaye School of Mathematics The University of Birmingham Birmingham B15 2TT

Add to Reading List

Source URL: web.mat.bham.ac.uk

Language: English - Date: 2007-05-31 06:58:26